Constrained Simultaneous and Near-Simultaneous Embeddings
نویسندگان
چکیده
منابع مشابه
Constrained Simultaneous and Near-Simultaneous Embeddings
A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawings Γ1 of G1 and Γ2 of G2, such that each vertex v2 = γ(v1) is mapped in Γ2 to the same point where v1 is mapped in Γ1, where v1 ∈ V1 and v2 ∈ V2. In this paper we examine several constrained versions of the geometric si...
متن کاملSimultaneous Geometric Graph Embeddings
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be placed in the plane in such a way that for each graph the straight-line drawing is planar. We partially settle an open problem of Erten and Kobourov [5] by showing that even for two graphs the problem is NP-hard. We also...
متن کاملColored Simultaneous Geometric Embeddings
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of size n for paths colored with two or three colors. We use these results to show that colored simultaneous geometric embeddings exist for: (1) a 2-colored tree together with any number of 2-colored p...
متن کاملOn Simultaneous Planar Graph Embeddings
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another in which the mapping is not given. We present positive and negative results for the two versions of the problem. Among the positive results with given mapping, we show that we can embed two paths on an n×...
متن کاملSimultaneous Embeddings with Few Bends and Crossings
A simultaneous embedding with fixed edges (SEFE) of two planar graphs R and B is a pair of plane drawings of R and B that coincide when restricted to the common vertices and edges of R and B. We show that whenever R and B admit a SEFE, they also admit a SEFE in which every edge is a polygonal curve with few bends and every pair of edges has few crossings. Specifically: (1) if R and B are trees ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2009
ISSN: 1526-1719
DOI: 10.7155/jgaa.00194